On the tail decay of M/G/1-type Markov renewal processes
نویسندگان
چکیده
The tail decay of M/G/1-type Markov renewal processes is studied. The Markov renewal process is transformed into a Markov chain so that the problem of tail decay is reformulated in terms of the decay of the coefficients of a suitable power series. The latter problem is reduced to analyze the analyticity domain of the power series.
منابع مشابه
A Markov Renewal Approach to M/G/1 Type Queues with Countably Many Background States
We consider the stationary distribution of the M/GI/1 type queue when background states are countable. We are interested in its tail behavior. To this end, we derive a Markov renewal equation for characterizing the stationary distribution using a Markov additive process that describes the number of customers in system when the system is not empty. Variants of this Markov renewal equation are al...
متن کاملExtended Geometric Processes: Semiparametric Estimation and Application to ReliabilityImperfect repair, Markov renewal equation, replacement policy
Lam (2007) introduces a generalization of renewal processes named Geometric processes, where inter-arrival times are independent and identically distributed up to a multiplicative scale parameter, in a geometric fashion. We here envision a more general scaling, not necessar- ily geometric. The corresponding counting process is named Extended Geometric Process (EGP). Semiparametric estimates are...
متن کاملSubexponential Asymptotics of a Network Multiplexer
For a Markov-modulated random walk with negative drift and long-tailed right tail we prove that the ascending ladder height matrix distribution is asymptotically proportional to a long-tailed distribution. This result enable us to generalize a recent result on subexponential asymptotics of a Markov-modulated M/G/1 queue to subexponential asymptotics of a Markov-modulated G/G/1 queue. For a clas...
متن کاملOn the Dual Relationship between Markov Chains of Gi/m/1 and M/g/1 Type
In 1990 Ramaswami proved that, given a Markov renewal process of M/G/1– type, one can construct a Markov renewal process of GI/M/1–type such that the matrix transforms G(z, s) for the M/G/1–type process and R(z, s) for the GI/M/1–type process satisfy a duality relationship. In his 1996 PhD thesis, Bright used time reversal arguments to show that it is possible to define a different dual for pos...
متن کاملLogarithmic Asymptotics for the GI/G/1-type Markov Chains and their Applications to the BMAP/G/1 Queue with Vacations
We study tail asymptotics of the stationary distribution for the GI=G=1-type Markov chain with finitely many background states. Decay rate in the logarithmic sense is identified under a number of conditions on the transition probabilities. The results are applied to the BMAP=G=1 queuewith vacations. The relationship between vacation time and the decay rate of the queue length distribution is in...
متن کامل